Network Pricing and The Price of Anarchy

نویسندگان

  • Robert Phillips
  • Serdar Simsek
  • A. Serdar Simsek
چکیده

We consider a network in which products consist of combinations of connecting edges and each edge corresponds to a perishable resource. In our model, different revenue-maximizing “controllers” determine the prices associated with different resources and the price of the product is the sum of the prices of the constituent resources. At one extreme, a single controller might set all resource prices – at the other extreme there would be a different controller associated with each resource. We show that decentralized pricing always leads to lower total revenue relative to centralized pricing. For the uncapacitated networks, we develop bounds on the “price of anarchy” – the loss from totally decentralized control versus centralized control – as the number of controllers increases. We present provably convergent algorithms for calculating Nash equilibrium prices for both the uncapacitated and capacitated cases. We present numerical analyses to illustrate the effect on producer and consumer surplus of decentralization. While we develop our model in the context of airline pricing, it is applicable to any service network such as freight transportation, pipelines, and toll roads as well as to the more general case of supply chain networks. ∗Columbia Business School and Nomis Solutions, e-mail: [email protected] †Columbia Business School, e-mail: [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Selfish Routers and the Price of Anarchy

We revisit Roughgarden and Tardos’s price of anarchy in network routing, in a new model in which routing decisions are made by the edges as opposed to the flows. We propose two models: the latency model in which edges seek to minimize the average latency of the flow through them on the basis of knowledge of latency conditions in the whole network, and the pricing model in which edges advertise ...

متن کامل

A New Look at Selfish Routing

We revisit price of anarchy in network routing, in a new model in which routing decisions are made by self-interested components of the network, as opposed to by the flows as in [12]. This significant departure from previous work on the problem seeks to model Internet routing more accurately. We propose two models: the latency model in which the network edges seek to minimize the average latenc...

متن کامل

The Price of Anarchy (POA) of network coding and routing based on average pricing mechanism

The congestion pricing is an efficient allocation approach to mediate demand and supply of network resources. Different from the previous pricing using Affine Marginal Cost (AMC), we focus on studying the game between network coding and routing flows sharing a single link when users are price anticipating based on an Average Cost Sharing (ACS) pricing mechanism. We characterize the worst-case e...

متن کامل

Strategic Network Formation through an Intermediary

Settings in which independent self-interested agents form connections with each other are extremely common, and are usually modeled using network formation games. We study a natural extension of network formation games in which the nodes cannot form connections themselves, but instead must do it through an intermediary, and must pay the intermediary to form these connections. The price charged ...

متن کامل

Design of price mechanisms for network resource allocation via price of anarchy

We study the design of price mechanisms for communication network problems in which a user’s utility depends on the amount of flow she sends through the network, and the congestion on each link depends on the total traffic flows over it. The price mechanisms are characterized by a set of axioms that have been adopted in the cost-sharing games, and we search for the price mechanisms that provide...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013